Linear Independence of Characters

نویسنده

  • KEITH CONRAD
چکیده

Example 1.1. A field homomorphism K → F is a character by restricting it to the nonzero elements of K (that is, using G = K×) and ignoring the additive aspect of a field homomorphism. In particular, when L/K is a field extension any element of Aut(L/K) is a field homomorphism L→ L and therefore is a character of L× with values in L×. Example 1.2. For any α ∈ F×, the map Z→ F× by k 7→ αk is a character of Z. Characters G→ F× can be regarded as special functions G→ F and then can be added, but the sum is no longer a character (since the sum of multiplicative maps is usually not multiplicative, and could even take the value 0). The sum is just a function G → F . The functions G → F form a vector space under addition and F -scaling. We will prove that different characters G → F× are linearly independent as functions G → F . Then we turn to three very important applications of this linear independence: • The normal basis theorem. • Hilbert’s Theorem 90 for cyclic Galois extensions. • Some basic ideas in Kummer theory and Artin-Schreier theory. While we will use Galois theory to prove results about characters, in [3] and [8] linear independence of characters is used to prove the Galois correspondence. That approach to Galois theory is due to Artin [1], who I think wanted to avoid the primitive element theorem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extension Theorems for Linear Codes over Finite Rings

Various forms of the extension problem are discussed for linear codes de ned over nite rings. The extension theorem for symmetrized weight compositions over nite Frobenius rings is proved. As a consequence, an extension theorem for weight functions over certain nite commutative rings is also proved. The proofs make use of the linear independence of characters as well as the linear independence ...

متن کامل

Independence of Tabulation-Based Hash Classes

A tabulation-based hash function maps a key into d derived characters indexing random values in tables that are then combined with bitwise xor operations to give the hash. Thorup and Zhang [8] presented d-wise independent tabulation-based hash classes that use linear maps over finite fields to map a key, considered as a vector (a, b), to derived characters. We show that a variant where the deri...

متن کامل

The Two Artin-Schreier Theorems

Proof. We prove by the following steps: y 1 Start with induction on n, for n = 1 the result is trivial. y 2 Let g be such that σ1(g) ̸= σ2(g) and consider ∑ aiσi(gx) = 0 and ∑ aiσ1(g)σi(x) = 0 y 3 Cancel one summand by showing a2 = 0 and eventually show all ai = 0 One can prove by induction. Let a1σ1 ≡ 0 then since σ1 does not map to 0 ∈ K one must have a1 = 0. Suppose now that for any linear co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008